Congruences for odd class numbers of quadratic fields with odd discriminant

نویسندگان

چکیده

For any distinct two primes \(p_1\equiv p_2\equiv 3\) \((\text {mod }4)\), let \(h(-p_1)\), \(h(-p_2)\) and \(h(p_1p_2)\) be the class numbers of quadratic fields \(\mathbb {Q}(\sqrt{-p_1})\), {Q}(\sqrt{-p_2})\) {Q}(\sqrt{p_1p_2})\), respectively. Let \(\omega _{p_1p_2}:=(1+\sqrt{p_1p_2})/2\) \(\varPsi (\omega _{p_1p_2})\) Hirzebruch sum _{p_1p_2}\). We show that \(h(-p_1)h(-p_2)\equiv h(p_1p_2)\varPsi _{p_1p_2})/n\) }8)\), where \(n=6\) (respectively, \(n=2\)) if \(min {p1, p2} > otherwise). also consider real order with conductor 2 in {Q}(\sqrt{p_1p_2})\).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discretisation for odd quadratic twists

The discretisation problem for even quadratic twists is almost understood, with the main question now being how the arithmetic Delaunay heuristic interacts with the analytic random matrix theory prediction. The situation for odd quadratic twists is much more mysterious, as the height of a point enters the picture, which does not necessarily take integral values (as does the order of the Shafare...

متن کامل

Odd Perfect numbers

It is not known whether or not odd perfect numbers can exist. However it is known that there is no such number below 10, (see Brent [1]). Moreover it has been proved by Hagis [4] and Chein [2] independently that an odd perfect number must have at least 8 prime factors. In fact results of this latter type can in principle be obtained solely by calculation, in view of the result of Pomerance [6] ...

متن کامل

Class numbers of ray class fields of imaginary quadratic fields

Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of Schoof to compute the class numbers of ray class fields Kp heuristically. We achieve this by using elliptic units analytically constructed by Stark and the Galois action on them given by Shimura’s reciprocity law. We have...

متن کامل

Guessing Numbers of Odd Cycles

For a given number of colours, s, the guessing number of a graph is the base s logarithm of the size of the largest family of colourings of the vertex set of the graph such that the colour of each vertex can be determined from the colours of the vertices in its neighbourhood. An upper bound for the guessing number of the n-vertex cycle graph Cn is n/2. It is known that the guessing number equal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ramanujan Journal

سال: 2022

ISSN: ['1572-9303', '1382-4090']

DOI: https://doi.org/10.1007/s11139-022-00673-2